Towards a Feature mu-Calculus Targeting SPL Verification
نویسندگان
چکیده
منابع مشابه
Towards a Feature mu-Calculus Targeting SPL Verification
The modal μ-calculus μL is a well-known fixpoint logic to express and model check properties interpreted over labeled transition systems. In this paper, we propose two variants of the μ-calculus, μLf and μLf , for feature transition systems. For this, we explicitly incorporate feature expressions into the logics, allowing operators to select transitions and behavior restricted to specific produ...
متن کاملTowards Abstraction-Based Verification of Shape Calculus
The Shape Calculus is a bio-inspired timed and spatial calculus for describing 3D geometrical shapes moving in a space. Shapes, combined with a behaviour, form 3D processes, i.e., individual entities able to bind with other processes on compatible spatial channels and to split over previously established bonds. Due to geometrical space, timed behaviours, a wide degree of freedom in defining mot...
متن کاملCompositional Verification of Evolving SPL
This paper presents a novel approach to the design verification of Software Product Lines(SPL). The proposed approach assumes that the requirements and designs are modeled as finite state machines with variability information. The variability information at the requirement and design levels are expressed differently and at different levels of abstraction. Also the proposed approach supports ver...
متن کاملAlternating Epistemic Mu-Calculus
Alternating-time temporal logic (ATL) is a wellknown logic for reasoning about strategic abilities of agents. An important feature that distinguishes variants of ATL for imperfect information scenarios is that the standard fixed point characterizations of temporal modalities do not hold anymore. In this paper, we show that adding explicit fixed point operators to the “next-time” fragment of ATL...
متن کاملThe Horn Mu-calculus
The Horn -calculus is a logic programming language allowing arbitrary nesting of least and greatest fixed points. The Horn -programs can naturally expresses safety and liveness properties for reactive systems. We extend the setbased analysis of classical logic programs by mapping arbitrary -programs into “uniform” -programs. Our two main results are that uniform -programs express regular sets o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.206.6